Tight bounds for capacities

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight Bounds for HTN Planning

Although HTN planning is in general undecidable, there are many syntactically identifiable sub-classes of HTN problems that can be decided. For these sub-classes, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize a propositional HTN formalization to one that is based upon a function-free first-order logic and...

متن کامل

Tight bounds for some problems

There are a number of fundamental problems in eomputational geometry for which work-optimal aJgorithDls exist which have a parallel running -fuDe of O(log n) in the PRAM model. These include problems like two and three dimensional convex-hulls, trapeSoidal decomposition, arrangement coDStruc:.tion, dommance among others. Further improvements in running time to sub-logarithmic range were not con...

متن کامل

Tight Bounds for Point Recolouring

In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of different colours become more reasonable. They show that an iterative recolouring method converges after a finite, but exponential, number of steps. They also give, as an example, a triangulated point set with a specifi...

متن کامل

Tight bounds for strategyproof classification

Strategyproof (SP) classification considers situations in which a decision-maker must classify a set of input points with binary labels, minimizing expected error. Labels of input points are reported by self-interested agents, who may lie so as to obtain a classifier more closely matching their own labels. These lies would create a bias in the data, and thus motivate the design of truthful mech...

متن کامل

Tight continuity bounds for the quantum conditional mutual information, for the Holevo quantity and for capacities of quantum channels

First we consider Fannes’ type and Winter’s type tight continuity bounds for the quantum conditional mutual information and their specifications for states of special types. Then we analyse continuity of the Holevo quantity with respect to nonequivalent metrics on the set of discrete ensembles of quantum states. We show that the Holevo quantity is continuous on the set of all ensembles of m sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1994

ISSN: 0898-1221

DOI: 10.1016/0898-1221(94)90067-1